Proof theory - PDFSEARCH.IO - Document Search Engine

Proof theory
Results: 1637

#	Item
881	A variant of the double-negation translation∗ Jeremy Avigad August 21, 2006 Abstract An efficient variant of the double-negation translation explains the Add to Reading List Source URL: www.hss.cmu.edu Language: English - Date: 2006-10-02 14:57:52 Model theory Formal languages Semantics Proof theory Dialectica interpretation Interpretation Intuitionistic logic First-order logic Well-formed formula Logic Mathematical logic Intuitionism
882	Sum of Squares Upper Bounds, Lower Bounds, and Open Questions Boaz Barak December 10, 2014 2 Add to Reading List Source URL: www.boazbarak.org Language: English - Date: 2014-12-10 16:53:22 Algorithm Clique problem Combinatorics NP PP Proof complexity Algorithmic Lovász local lemma Switching lemma Theoretical computer science Computational complexity theory Applied mathematics
883	Simplest Cubic Fields Franz Lemmermeyer, Attila Peth¨o1 Franz Lemmermeyer Bilkent University Department of Mathematics[removed]Bilkent, Ankara Add to Reading List Source URL: www.fen.bilkent.edu.tr Language: English - Date: 2003-09-11 11:03:49 Diophantine approximation Proof theory Constructible universe Ordinal numbers Set theory
884	Ivor, a Proof Engine Edwin Brady School of Computer Science, University of St Andrews, St Andrews, Scotland. Email: [removed]. Tel: +[removed], Fax: +[removed] Add to Reading List Source URL: eb.host.cs.st-andrews.ac.uk Language: English - Date: 2007-02-05 08:12:08 Functional languages Type theory Lambda calculus Logic in computer science Functional programming Combinatory logic Fixed-point combinator Dependent type Monad Software engineering Declarative programming Theoretical computer science
885	A PROOF OF COMPLETENESS FOR CONTINUOUS FIRST-ORDER LOGIC ITA¨I BEN YAACOV AND ARTHUR PAUL PEDERSEN A BSTRACT. Continuous first-order logic has found interest among model theorists who wish to extend the classical analys Add to Reading List Source URL: centria.di.fct.unl.pt Language: English - Date: 2009-09-10 18:19:28 Metalogic Interpretation Łukasiewicz logic First-order logic Structure Elementary class Ultraproduct Many-valued logic Compactness theorem Model theory Logic Mathematical logic
886	COMPUTER SCIENCE TRIPOS Part IA – 2014 – Paper 2 9 Discrete Mathematics (AMP) (a) The subset S of N = {0, 1, 2, . . .} is inductively defined by the following axiom and rules, where n ranges over N: Add to Reading List Source URL: www.cl.cam.ac.uk Language: English - Date: 2014-06-09 10:18:43 Mathematical proofs Inductive reasoning Mathematical induction Proof theory Constructible universe Universal quantification String Surreal number Peano axioms Mathematics Mathematical logic Logic
887	Trace-Based Network Proof Systems: Expressiveness and Completeness JENNIFER WIDOM Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2013-09-09 22:08:39 Model theory Non-classical logic Abstraction Axiology First-order logic Parallel computing Modal logic Trace Temporal logic Logic Mathematics Mathematical logic
888	Real Analysis Exchange Summer Symposium 2009, pp. 30–34 Emma D’Aniello, Dipartimento di Matematica, Seconda Universit`a degli Studi di Napoli, Via Vivaldi 43, 81100 Caserta, Italy. email: [removed] Add to Reading List Source URL: www.stolaf.edu Language: English - Date: 2010-01-15 15:07:38 Constructible universe Mathematics Proof theory Ordinal arithmetic Hölder condition Mathematical logic Limit set Ordinal number
889	RATIONAL QUARTIC RECIPROCITY FRANZ LEMMERMEYER Abstract. We provide a simple proof of the general rational quartic reciprocity law due to Williams, Hardy and Friesen. In 1985, K. S. Williams, K. Hardy and C. Friesen [11 Add to Reading List Source URL: www.fen.bilkent.edu.tr Language: English - Date: 2003-09-11 11:03:07 Modular arithmetic Algebraic number theory Quadratic residue Quartic reciprocity Reciprocity law Quadratic reciprocity Legendre symbol Prime number Reciprocity Abstract algebra Number theory Mathematics
890	The Undecidability of k-Provability Samuel R. Buss∗ Department of Mathematics University of California, San Diego April 3, 1989 Add to Reading List Source URL: www.math.ucsd.edu Language: English - Date: 2002-07-11 12:08:00 Automated theorem proving Mathematics Sequent calculus Unification Sequent First-order logic Curry–Howard correspondence Natural deduction Mathematical logic Proof theory Logic

UPDATE